Marxist theory database query optimization based on improved ID3 algorithm
نویسندگان
چکیده
Focused on the problem that the data query of Marxist theory database requires to be optimized, this paper proposes a database query optimization strategy based on improved ID3 algorithm. It firstly changes the measure of property selection in data set so as to decrease the computational expense and generation time, then adjusts the calculation of information gain to the calculation of residual value of information gain and selects the property with minimum residual value as a new standard to replace the original information gain. Simulation experiment shows that improved ID3 algorithm is superior to standard ID3 algorithm in accuracy and time consumption in the establishment of decision-making tree.
منابع مشابه
Relational Databases Query Optimization using Hybrid Evolutionary Algorithm
Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...
متن کاملA Modified Grasshopper Optimization Algorithm Combined with CNN for Content Based Image Retrieval
Nowadays, with huge progress in digital imaging, new image processing methods are needed to manage digital images stored on disks. Image retrieval has been one of the most challengeable fields in digital image processing which means searching in a big database in order to represent similar images to the query image. Although many efficient researches have been performed for this topic so far, t...
متن کاملOptimizing Large Query by Simulated Annealing Algorithm Based On Graph-Based Approach
In the relational database setting today, large queries containing many joins are becoming increasingly common. In general the ordering of join-operations is quite sensitive and has a devastatingly negative effect on the efficiency of the DBMS. Scheufele and Moerkotte proved that join-ordering is NP-complete in the general case [1]. The dynamic programming algorithm has a worst case running tim...
متن کاملAn Effective Path-aware Approach for Keyword Search over Data Graphs
Abstract—Keyword Search is known as a user-friendly alternative for structured languages to retrieve information from graph-structured data. Efficient retrieving of relevant answers to a keyword query and effective ranking of these answers according to their relevance are two main challenges in the keyword search over graph-structured data. In this paper, a novel scoring function is proposed, w...
متن کاملAn Algorithm for Better Decision Tree
The present paper aims at constructing the decision tree for a given database which adopts an improved ID3 decision tree algorithm to implement data mining in order to predict the output. The database is generated using the sampling techniques and the classification algorithm is applied on the samples. The obtained results are compared with experimental results in order to verify the validity a...
متن کامل